Asynchronous Group Mutual Exclusion in Ring Networks
نویسندگان
چکیده
The design issues for group mutual exclusion have been modeled by Joung as the Congenial Talking Philosophers, and solutions for shared-memory models and complete message-passing networks have been proposed [2, 3]. These solutions, however, cannot be straightforwardly and efficiently converted to ring networks where each philosopher can only communicate directly with its two neighboring philosophers. As rings are also a popular network topology, in this paper we focus the Congenial Talking Philosophers on ring networks and present an efficient and highly concurrent distributed algorithm for the problem.
منابع مشابه
Self-Stabilizing -out-of- Exclusion
In this paper, self-stabilizing asynchronous distributed algorithms are given for the -out-ofexclusion problem, a generalization of the mutual exclusion problem, in which there are units of a resource, and any process can request up to units. We consider two network topologies, a tree and a unidirectional ring. The networks are anonymous except for one distinguished process. The ring algorithm ...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملMutual exclusion in asynchronous systems with failure detectors
This paper defines the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem. This failure detector, which we call the trusting failure detector, and which we denote by T , is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector P . The pa...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کامل